Infinite Computations in Concurrent Constraint Programming
نویسندگان
چکیده
منابع مشابه
Timed Concurrent Constraint Programming with Instantaneous Computations 4
The timed concurrent constraint programming language (tccp in short), was introduced for modeling reactive systems. This language allows one to model in a very intuitive way typical ingredients of these systems such as timeouts, preemptions, etc. However, there is no natural way for modeling other desirable features such as functional computations, for example for calculating arithmetic results...
متن کاملTruly Concurrent Constraint Programming
We study “causality” relationships in Concurrent Constraint Programming: what is observed is not just the conjunction of constraints deposited in the store, but also the causal dependencies between these constraints. We describe a denotational semantics for cc that is fully-abstract with respect to observing this “causality” relation on constraints. This semantics preserves more fine-grained st...
متن کاملSubexponential concurrent constraint programming
In previous works we have shown that linear logic with subexponentials (SELL), a refinement of linear logic, can be used to specify emergent features of concurrent constraint programming (CCP) languages, such as preferences and spatial, epistemic and temporal modalities. In order to do so, we introduced a number of extensions to SELL, such as subexponential quantifiers for the specification of ...
متن کاملTemporal Concurrent Constraint Programming
The temporal ccp model tcc [3] is aimed at specifying timed systems. Time is conceptually divided into discrete intervals. In a particular time interval, a ccp process receives a stimulus (i.e. a constraint) from the environment, it executes with this stimulus as the initial store, and when it reaches its resting point, it responds to the environment with the resulting store. Also the resting p...
متن کاملStochastic Concurrent Constraint Programming
We present a stochastic version of Concurrent Constraint Programming (CCP), where we associate a rate to each basic instruction that interacts with the constraint store. We give an operational semantic that can be provided either with a discrete or a continuous model of time. The notion of observables is discussed, both for the discrete and the continuous version, and a connection between the t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Theoretical Computer Science
سال: 1997
ISSN: 1571-0661
DOI: 10.1016/s1571-0661(05)80167-7